The cohesive metaschema: a higher-level abstraction of the UMLS Semantic Network
نویسندگان
چکیده
The Unified Medical Language System (UMLS) joins together a group of established medical terminologies in a unified knowledge representation framework. Two major resources of the UMLS are its Metathesaurus, containing a large number of concepts, and the Semantic Network (SN), containing semantic types and forming an abstraction of the Metathesaurus. However, the SN itself is large and complex and may still be difficult to view and comprehend. Our structural partitioning technique partitions the SN into structurally uniform sets of semantic types based on the distribution of the relationships within the SN. An enhancement of the structural partition results in cohesive, singly rooted sets of semantic types. Each such set is named after its root which represents the common nature of the group. These sets of semantic types are represented by higher-level components called metasemantic types. A network, called a metaschema, which consists of the meta-semantic types connected by hierarchical and semantic relationships is obtained and provides an abstract view supporting orientation to the SN. The metaschema is utilized to audit the UMLS classifications. We present a set of graphical views of the SN based on the metaschema to help in user orientation to the SN. A study compares the cohesive metaschema to metaschemas derived semantically by UMLS experts.
منابع مشابه
A lexical metaschema for the UMLS semantic network
OBJECTIVE A metaschema is a high-level abstraction network of the UMLS's semantic network (SN) obtained from a partition of the SN's collection of semantic types. Every metaschema has nodes, called meta-semantic types, each of which denotes a group of semantic types constituting a subject area of the SN. A new kind of metaschema, called the lexical metaschema, is derived from a lexical partitio...
متن کاملA metaschema of the UMLS based on a partition of its semantic network
The Unified Medical Language System's (UMLS's) Semantic Network (SN) provides an important conceptual abstraction that helps orient users to the vast knowledge content of its Metathesaurus. However, the SN is itself large and complex, and can also benefit from an additional abstract view of its own. In this paper, we present a metaschema that serves such a purpose. This metaschema is derived fr...
متن کاملComparing and consolidating two heuristic metaschemas
A metaschema is an Abstraction Network of the UMLS's Semantic Network (SN) obtained from a connected partition into its collections of semantic types. A metaschema can support comprehension, visualization and navigation of the SN. In this paper, a methodology is presented to evaluate and compare two given metaschemas, based on their structural properties. This methodology was applied to the top...
متن کاملAn expert study evaluating the UMLS lexical metaschema
OBJECTIVE A metaschema is an abstraction network of the UMLS's semantic network (SN) obtained from a connected partition of its collection of semantic types. A lexical metaschema was previously derived based on a lexical partition which partitioned the SN into semantic-type groups using identical word-usage among the names of semantic types and the definitions of their respective children. In t...
متن کاملDesigning metaschemas for the UMLS enriched semantic network
The enriched semantic network (ESN) has previously been presented as an enhancement of the semantic network (SN) of the UMLS. The ESN's hierarchy is a DAG (Directed Acyclic Graph) structure allowing for multiple parents. The ESN is thus more complex than the SN and can be more difficult to view and comprehend. We have previously introduced the notion of a metaschema for the SN as a compact abst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of biomedical informatics
دوره 35 3 شماره
صفحات -
تاریخ انتشار 2002